
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 2295. -- 【POJ Challenge】我爱你啊 -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>2295: 【POJ Challenge】我爱你啊</h2><span class=green>Time Limit: </span>1 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>128 MB<br><span class=green>Submit: </span>91&nbsp;&nbsp;<span class=green>Solved: </span>63<br>[<a href='submitpage.php?id=2295'>Submit</a>][<a href='problemstatus.php?id=2295'>Status</a>][<a href='bbs.php?id=2295'>Discuss</a>]</center><h2>Description</h2><div class=content><p>
<dd>
<div>
<p>ftiasch是个十分受女生欢迎的同学，所以她总是收到许多情书。虽然她十分有魅力，然而她却是个低调的人。因此她从来不会告诉别人她到底收到了多少情书。</p>
<p>ftiasch的好朋友1tthinking想知道她到底收到了多少情书。1tthinking知道，ftiasch每次收到一封情书，就会在日记最后写下一个包含&quot;luvletter&quot;子序列的串。比如现在ftiasch的日记是alduddvdletterflusvletetedr，那么ftiasch可能受到了0、1、2封情书。现在给出一些ftiasch的日记，问对于每篇日记，ftiasch最多可能受到多少的情书。</p>
<p>某个序列的子序列是从最初序列通过去除某些元素但不破坏馀下元素的相对位置而形成的新序列。<a href="http://en.wikipedia.org/wiki/Subsequence"><font color="#3b5998">參考wikipedia</font></a>。</p>
<p><img src="http://media.openjudge.cn/images/g3205_1.jpg" alt="" /></p>
</div>
</dd>
</p></div><h2>Input</h2><div class=content><p>
<dt>第1行，一个整数 <em>T</em> (0 &le; <em>T</em> &le; 100), 日记的数量。 </dt>
<dd>
<div>
<p>第2到 <em>T</em> + 1行，ftiasch的日记 (只包含'a'-'z' 和空格, 长度小于100001)</p>
</div>
</dd>
</p></div><h2>Output</h2><div class=content><p>
<dd>第1到T行，一个整数, 最大可能的情书数量。
<p></p>
</dd>
<dd></dd>
</p></div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>5<br />
t<br />
llllluvletterrr<br />
luvletterlauavalaeatataearaluvletter<br />
is wzk a famous boy yes buz he always receives a lot of luv letters<br />
my heart beats her waves at the shore of the world and writes upon it her signature in tears with the words i love thee<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>0<br />
1<br />
3<br />
1<br />
0<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search='></a></p></div><center>[<a href='submitpage.php?id=2295'>Submit</a>][<a href='problemstatus.php?id=2295'>Status</a>][<a href='bbs.php?id=2295'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
